Polygonal products of polycyclic by finite groups
نویسندگان
چکیده
منابع مشابه
Algorithms for Polycyclic-by-finite Groups Algorithms for Polycyclic-by-finite Groups Table of Contents
OF THE DISSERTATION Algorithms for Polycyclic-by-Finite Groups by Gretchen Ostheimer Dissertation Director: Professor Charles C. Sims Let R be a number eld. We present several algorithms for working with polycyclicbynite subgroups of GL(n;R). Let G be a subgroup of GL(n;R) given by a nite generating set of matrices. We describe an algorithm for deciding whether or not G is polycyclic-bynite. Fo...
متن کاملAutomorphism groups of polycyclic-by-finite groups and arithmetic groups
We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of the algebraic hull functor initiated by Mostow. We thus make applicable refined methods from the theory of algebraic and arithmetic groups. We also construc...
متن کاملAlgorithms for polycyclic-by-finite matrix groups
Let K be a number eld. We present several algorithms for working with polycyclic-by-nite subgroups of GL(n; K). Let G be a subgroup of GL(n; K) given by a nite generatingset of matrices. We describe an algorithm for deciding whether or not G is polycyclic-by-nite. For polycyclic-by-nite G, we describe an algorithm for deciding whether or not a given matrix is an element of G. We also describe a...
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملPrime Ideals in Group Algebras Oe Polycyclic-by-finite Groups
Introduction Group algebras K[G] of poly cyclic-by-finite groups are easily-defined, interesting examples of right and left Noetherian rings. Since prime rings and prime ideals are the basic building blocks in the Goldie theory of Noetherian rings, the determination of the structure of the prime ideals of K[G] is certainly of importance. In a recent fundamental paper [8], Roseblade proved that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1996
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700021778